Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
نویسندگان
چکیده
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable cases ranges from 3 items and 15 periods to 10 items and 3 periods. Furthermore, it will become clear that rescheduling can neatly be done. ( 2000 Elsevier Science B.V. All
منابع مشابه
Lot Sizing and Scheduling with Sequence Dependent Setup Costs and times and Eecient Rescheduling Opportunities
1 Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only eecient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and eeciently. Furthermore, it will become cl...
متن کاملSimultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملLot sizing and scheduling with sequence-dependent setup costs and times and e$cient rescheduling opportunities
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...
متن کاملAn efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and setup costs. The approach is partly based on the earlier work of Haase and Kimms [2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of ...
متن کاملThe Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
متن کامل